Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
471	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 8 Due on April 3 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 Computational complexity theory Analysis of algorithms Mosaic Symmetry Tessellation Algorithm Time complexity Dynamic programming Euclidean algorithm Theoretical computer science Applied mathematics Mathematics
472	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann† Add to Reading List Source URL: cccg.ca Language: English - Date: 2013-08-11 21:51:56 Analysis of algorithms Triangulation Computational complexity theory Time complexity Algorithm Randomized algorithm Big O notation Delaunay triangulation Planar separator theorem Theoretical computer science Mathematics Applied mathematics
473	CME 305: Discrete Mathematics and Algorithms 1 Approximation Algorithms Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:44:41 Operations research Computational complexity theory NP-complete problems Job shop scheduling Mathematical optimization Approximation algorithm Linear programming Algorithm Vertex cover Theoretical computer science Applied mathematics Mathematics
474	How hard is it to approximate the Jones polynomial? Greg Kuperberg∗ Department of Mathematics, University of California, Davis, CAarXiv:0908.0512v2 [quant-ph] 27 Oct 2014 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-10-27 20:33:15 Polynomials Matroid theory Tutte polynomial Time complexity IP XTR PP P/poly Bounded-error probabilistic polynomial Theoretical computer science Mathematics Computational complexity theory
475	When and How Can Data be Efficiently Released with Privacy? Cynthia Dwork Moni Naor∗ Omer Reingold Salil Vadhan Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-11-01 14:13:39 Data privacy Applied probability Exponential mechanism Time complexity Differential privacy Constructible universe Polynomial Negligible function PP Theoretical computer science Mathematics Computational complexity theory
476	A Scalable and Nearly Uniform Generator of SAT Witnesses? Supratik Chakraborty1 , Kuldeep S. Meel2 , and Moshe Y. Vardi2 1 2 Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2013-07-17 18:10:56 Search algorithms Cryptographic hash functions Analysis of algorithms Probabilistic complexity theory Randomized algorithm PP Algorithm Hash function Universal hashing Theoretical computer science Applied mathematics Computational complexity theory
477	Containment of Data Graph Queries Egor V. Kostylev Juan L. Reutter University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2013-11-07 07:11:59 Computational complexity theory Graph Connectivity FO Reachability Tree Theoretical computer science Mathematics Graph theory
478	The Complexity of Flow Analysis in Higher-Order Languages David Van Horn The Complexity of Flow Analysis in Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2009-08-14 14:13:52 Models of computation Notation Programming language Lambda calculus Control flow analysis Algorithm International Conference on Functional Programming Functional programming Computational complexity theory Theoretical computer science Applied mathematics Computer science
479	Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-05-17 00:53:00 Quantum complexity theory Probabilistic complexity theory Models of computation Analysis of algorithms Randomized algorithm PP Decision tree model IP MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics
480	Abstract: One of the main goals of bounded rationality models is to understand the limitations of agent’s abilities in building representations of strategic situations as maximization problems and in solving these pr Add to Reading List Source URL: ogossner.free.fr Language: English - Date: 2005-10-17 11:51:33 Turing machine Computability theory Models of computation Alan Turing Computational complexity theory Algorithm NP PP Computability Theoretical computer science Applied mathematics Computer science

UPDATE